Approximate evaluations of characteristic polynomials of Boolean functions
نویسندگان
چکیده
منابع مشابه
Tutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملApproximate polynomial degree of Boolean functions and its applications
The approximate polynomial degree of a Boolean function f : {0, 1} ! {0, 1} is the smallest k such that there is a degree-k polynomial approximating f on 0/1 inputs. We survey recent developments on this subject. 2000 Mathematics Subject Classification: 20C30, 20J05.
متن کاملEvaluations of Graph Polynomials
A graph polynomial p(G, X̄) can code numeric information about the underlying graph G in various ways: as its degree, as one of its specific coefficients or as evaluations at specific points X̄ = x̄0. In this paper we study the question how to prove that a given graph parameter, say ω(G), the size of the maximal clique of G, cannot be a fixed coefficient or the evaluation at any point of the Tutte...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Characteristic Polynomials
Introduction. Let F be a field and let V be a finite dimensional vector space over F which is also a module over the ring F[a]. Here a may lie in any extension ring of F. We do not assume, as yet, that V is a faithful module, so that a need not be a linear transformation on V. It is known that by means of a decomposition of V into cyclic F[a]-modules we may obtain a definition of the characteri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00151-1